A several new mixed integer linear programming formulations for exploration of online social networks
نویسنده
چکیده
The goal of this paper is to identify the most promising sets of closest assignment constraints from the literature, in order to improve mixed integer linear programming formulations for exploration of information flow within a social network. The direct comparison between proposed formulations is performed on standard single source capacitated facility location problem instances. Therefore, in contrast to previous work, these results could be verified, validated and used in direct comparison by some possible future method.
منابع مشابه
A new mixed integer linear programming formulation for one problem of exploration of online social networks
Enormous global popularity of online social network sites has initiated numerous studies and methods investigating different aspects of their use, so some concepts from network-based studies in optimization theory can be used for research into online networks. In Gajić (2014) are given a several new mixed integer linear programming formulations for first and second problem of exploration of onl...
متن کاملDetailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries
In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...
متن کاملALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT
Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...
متن کاملSolving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملOptimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014